package bit;

public class leetcode136只出现一次的数字 {
    public int singleNumber(int[] nums) {
        int length = nums.length;
        int sum = 0;
        for (int i = 0; i < length; i++) {
            sum ^= nums[i];
        }
        return sum;
    }
}

